On a Discrete Kolmogorov Criterion

Enhancing Network Intrusion Classification through the Kolmogorov-smirnov Splitting Criterion

Our investigation aims at detecting network intrusions using decision tree algorithms. Large differences in prior class probabilities of intrusion data have been reported to hinder the performance of decision trees. We propose to replace the Shannon entropy used in tree induction algorithms with a Kolmogorov Smirnov splitting criterion which locates a Bayes optimal cutpoint of attributes. The K...

A Survey on Kolmogorov Complexity

Kolmogorov complexity, which is also called algorithmic (descriptive) complexity is an object, such as a piece of text, to measure the computational resources needed, which are mostly the length of the shortest binary program to specify an object. Strings whose Kolmogorov complexity is small relative to the string’s size are not considered to be complex and easy to use a short program to specif...

Stability Criterion for Discrete-Time Systems

This paper is concerned with the problem of delay-dependent stability analysis for discrete-time systems with interval-like time-varying delays. The problem is solved by applying a novel Lyapunov functional, and an improved delay-dependent stability criterion is obtained in terms of a linear matrix inequality.

Asymptotical Behaviors of Nonautonomous Discrete Kolmogorov System with Time Lags

A New Chaos Synchronization Criterion for Discrete Dynamical Systems

In this paper, we propose a simple method for chaos synchronization in discrete-time, based on new criterion for stability. This criterion implying the Lyapunov stabilization criterion, and is applicable to some typical chaotic systems. Keywords: Chaos synchronization, dynamical systems, new criterion, discrete-time, Lyapunov stability 1 Introduction During the last decade, synchronization of c...